A Class of Multiple Objective Mathematical Programming Problems in a Rough Environment
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملa new approach to solve multiple objective programming problems
multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملInteractive multiple objective programming in optimization of the fully fuzzy quadratic programming problems
In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered. To optimize th...
متن کاملA necessary condition for multiple objective fractional programming
In this paper, we establish a proof for a necessary condition for multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we present the related semi parametric model.
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2016
ISSN: 2345-3605
DOI: 10.24200/sci.2016.3836